Cyclic error-locating codes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Triple-Error-Correcting Cyclic Codes

We consider a class of 3-error-correcting cyclic codes of length 2−1 over the two-element field F2. The generator polynomial of a code of this class has zeroes α, α i +1 and α j , where α is a primitive element of the field F2m . In short, {1, 2+1, 2 +1} refers to the zero set of these codes. Kasami in 1971 and Bracken and Helleseth in 2009, showed that cyclic codes with zeroes {1, 2 + 1, 2 + 1...

متن کامل

Error Locating Codes Dealing with Repeated Burst Errors

This paper obtains bound for linear codes which are capable to detect and locate errors which occur during the process of transmission. The kind of errors considered are known as repeated burst errors of length b(fixed) introduced by Dass and Garg [10] which has its seeds in the work carried out by Srinivas et al. [15] in connection with models of stroke-induced epilepsy which is an area of mat...

متن کامل

Cyclic unequal error protection codes constructed from cyclic codes of composite length

The unequal error correction capabilities of binary cyclic codes of composite length aye investigated. Under certain conditions, direct sums of concatenated codes have unequal error correction capabilities. By a modified Hartmann and Tzeng algorithm, it is shown that a binary cyclic code of composite length is equivalent to the direct sum of concatenated codes. With this, some binary cyclic une...

متن کامل

Error Locating Codes by Using Blockwise-tensor Product of Blockwise Detecting/correcting Codes

In this paper, we obtain lower and upper bounds on the number of parity check digits of a linear code that corrects e or less errors within a subblock. An example of such a code is provided. We introduce blockwise-tensor product of matrices and using this, we propose classes of error locating codes (or EL-codes) that can detect e or less errors within a sub-block and locate several such corrupt...

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1967

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(67)90192-1